Hyper Tableaux | the next Generation Hyper Tableaux — the next Generation
نویسنده
چکیده
" Hyper tableau " is a sound and complete calculus for first-order clausal logic. The present paper introduces an improvement which removes the major weakness of the calculus, which is the need to (at least partially) blindly guess ground-instantiations for certain clauses. This guessing is now replaced by a unification-driven technique. The calculus is presented in detail, which includes a completeness proof. Completeness is proven by using a novel approach to extract a model from an open branch. This enables semantical redundancy criteria which are not present in related approaches.
منابع مشابه
HyperS Tableaux - Heuristic Hyper Tableaux
Several syntactic methods have been constructed to automate theorem proving in first-order logic. The positive (negative) hyper-resolution and the clause tableaux were combined in a single calculus called hyper tableaux in [1]. In this paper we propose a new calculus called hyperS tableaux which overcomes substantial drawbacks of hyper tableaux. Contrast to hyper tableaux, hyperS tableaux are e...
متن کاملMinimal Model Generation Based on E-hyper Tableaux
Minimal model generation has received great attention as people have deeper and deeper understanding in the semantics of the logic programming, deductive database, non monotonic reasoning and the relationships among them. But most proposed minimal model generation procedures in the literature are inappropriate in the sense that while generating minimal model, they also generate non-minimal mode...
متن کاملRedundancy for rigid clausal tableaux
Redundancy is a substantial concept when avoiding endless computation in theorem proving methods. In this paper, we are targeting a special class of tableau calculi, namely rigid clausal tableaux. These tableaux are (1) clausal in the sense that they consist solely of literals, and are (2) rigid in the sense that they employ rigid variables. Such calculi are e.g. rigid hyper tableaux [7] and mu...
متن کاملInstitut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Positive Unit Hyper-resolution Tableaux for Minimal Model Generation Positive Unit Hyper-resolution Tableaux for Minimal Model Generation
Minimal Herbrand models for clausal theories are useful in several areas of computer science, e.g. automated theorem proving, program veriication, logic programming, databases, and artiicial intelligence. In most cases, the conventional model generation algorithms are inappropriate because they generate nonminimal Herbrand models and can be ineecient. This article describes a novel approach for...
متن کاملConstrained Hyper Tableaux
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper tableaux are a generalization of hyper tableaux, where branch closing substitutions, from the point of view of model generation, give rise to constraints on satisfying assignments for the branch. These variable constraints...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998